Reformulating the disjunctive cut generating linear program

Cut-Generating Functions for Integer Linear Programming

1

Disjunctive Logic Program = Horn Program + Control Program Disjunctive Logic Program = Horn Program + Control Program

This paper presents an alternative view on propositional dis-junctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new propositional atoms and controls the \execution" of the ...

Disjunctive Logic Program = Horn Program + Control Program

This paper presents an alternative view on propo-sitional disjunctive logic program: Disjunctive program = Control program + Horn program. For this we introduce a program transformation which transforms a disjunctive logic program into a Horn program and a so called control program. The control program consists of only disjunctions of new proposi-tional atoms and controls the \execution" of the...

Cut-Generating Functions

In optimization problems such as integer programs or their relaxations, one encounters feasible regions of the form {x ∈ R+ : Rx ∈ S} where R is a general real matrix and S ⊂ R is a specific closed set with 0 / ∈ S. For example, in a relaxation of integer programs introduced in [ALWW2007], S is of the form Z − b where b 6∈ Z . One would like to generate valid inequalities that cut off the infea...

Reasoning with Disjunctive Constrained Tuple-Generating Dependencies